Countable Homogeneous Lattices
نویسندگان
چکیده
We show that there are uncountably many countable homogeneous lattices. We give a discussion of which such lattices can be modular or distributive. The method applies to show that certain other classes of structures also have uncountably many homogeneous members.
منابع مشابه
Characterization of Partial Lattices on Countable Boolean Lattice
In this paper new concepts countable join property, countable meet property, P–lattice and Pδ –lattice are introduced. We established that P–lattice and Pδ –lattice are measureable partial lattices and characterized partial lattices of a lattice through countable join and meet properties. We also established some interesting result on the injective property of the lattice measurable functio...
متن کاملEmbeddings into the Medvedev and Muchnik lattices of Π1 classes
Let Pw and PM be the countable distributive lattices of Muchnik and Medvedev degrees of non-empty Π1 subsets of 2 , under Muchnik and Medvedev reducibility, respectively. We show that all countable distributive lattices are lattice-embeddable below any non-zero element of Pw. We show that many countable distributive lattices are lattice-embeddable below any non-zero element of PM .
متن کاملChain Conditions in the Distributive Free Product of Lattices
1. Introduction. A typical result of this paper is the following. Let Lt, i e I be distributive lattices satisfying the countable chain condition. Then the free product L of these lattices also satisfies the countable chain condition. To be able to state the general result we need some notations. Let trt be an infinite cardinal. A poset (partially ordered set) P is said to satisfy the m-chain c...
متن کاملON THE CHARACTER AND r-WEIGHT OF HOMOGENEOUS COMPACTA
Under GCH, k(X) _< ~(X) for every homogeneous compactum X. CH implies that a homogeneous compactum of countable ~r-weight is first countable. There is a compact space of countable 7r-weight and uncountable character which is homogeneous under MA+-~CH, but not under CH.
متن کاملOrdinal Sums of Projectives in Varieties of Lattices
(A for ‘above’; B for ‘below.’) A lattice satisfying this condition is called finitely separable. It is easy to see that every countable lattice is finitely separable. We used this to show the following surprising result: the ordinal sum of two free lattices is projective if and only if one of them is finitely generated or both are countable. In this note we give a complete characterization of ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Order
دوره 32 شماره
صفحات -
تاریخ انتشار 2015